On the Turing degrees of minimal index sets
نویسندگان
چکیده
منابع مشابه
On the Turing degrees of minimal index sets
We study generalizations of shortest programs as they pertain to Schaefer’s MIN∗ problem. We identify sets of m-minimal and T-minimal indices and characterize their truth-table and Turing degrees. In particular, we show MIN ⊕ ∅′′ ≡T ∅′′′, MIN (n) ⊕ ∅(n+2) ≡T ∅(n+4), and that there exists a Kolmogorov numbering ψ satisfying both MINψ ≡tt ∅′′′ and MIN (n) ψ ≡T ∅(n+4). This Kolmogorov numbering al...
متن کاملOn minimal wtt-degrees and computably enumerable Turing degrees
Computability theorists have studied many different reducibilities between sets of natural numbers including one reducibility (≤1), many-one reducibility (≤m), truth table reducibility (≤tt), weak truth table reducibility (≤wtt) and Turing reducibility (≤T ). The motivation for studying reducibilities stronger that Turing reducibility stems from internally motivated questions about varying the ...
متن کاملOn the Degrees of Index Sets
A class of recursively enumerable sets may be classified either as an object in itself — the range of a two-place function in the obvious way — or by means of the corresponding set of indices. The latter approach is not only more precise but also, as we show below, provides an alternative method for solving certain problems on recursively enumerable sets and their degrees of unsolvability. The ...
متن کاملOn the Degrees of Index Sets. Ii
In [8] we proved that the index-set corresponding to any recursively enumerable degree a is of the highest isomorphism-type possible for sets belonging to S3(a). From the proof of this result we derived Sacks' theorem [4] that the recursively enumerable degrees are dense. In the present paper we classify three other indexsets associated with any given recursively enumerable degree a, namely the...
متن کاملTuring Degrees of Limit Sets of Cellular
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a computable point and that any non-trivial property on them is undecidable. We go one step further in this article by giving a full characterization of the sets of T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2007
ISSN: 0168-0072
DOI: 10.1016/j.apal.2007.07.003